Parallel Metropolis Coupled Markov Chain Monte Carlo for Isolation with Migration Model
نویسندگان
چکیده
Isolation with Migration model (IM), which jointly estimates divergence times and migration rates between two populations from DNA sequence data, can capture many phenomena when one population splits into two. The parameters inferences for IM are based on Markov Chain Monte Carlo method (MCMC). Standard implementations of MCMC are prone to fall into local optima. Metropolis Coupled MCMC [(MC)3] as a variant of MCMC can more readily explore multiple peaks in posterior distribution of trees. Expensive execution time has limited the application of (MC)3. This paper proposes a Parallel Metropolis Coupled Markov Chain Monte Carlo for IM. The proposed parallel algorithm retains the ability of (MC)3 and maintains a fast execution time. Performance results indicate nearly linear speed improvement. This paper provides researcher with rapider and more high-efficiency methods to study population genetics and molecular ecology problems aided with super computer.
منابع مشابه
On the swapping algorithm
The Metropolis-coupled Markov chain method (or “Swapping Algorithm”) is an empirically successful hybrid Monte Carlo algorithm. It alternates between standard transitions on parallel versions of the system at different parameter values, and swapping two versions. We prove rapid mixing for two bimodal examples, including the mean-field Ising model. © 2002 Wiley Periodicals, Inc. Random Struct. A...
متن کاملParallel Metropolis coupled Markov chain Monte Carlo for Bayesian phylogenetic inference
MOTIVATION Bayesian estimation of phylogeny is based on the posterior probability distribution of trees. Currently, the only numerical method that can effectively approximate posterior probabilities of trees is Markov chain Monte Carlo (MCMC). Standard implementations of MCMC can be prone to entrapment in local optima. Metropolis coupled MCMC [(MC)(3)], a variant of MCMC, allows multiple peaks ...
متن کاملParallel Chains, Delayed Rejection and Reversible Jump MCMC for Object Recognition
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generated via Markov chain Monte Carlo (MCMC) techniques using a novel combination of Metropolis-coupled MCMC (MCMCMC) [2] and the Delayed Rejection Algorithm (DRA) [4]. The method is illustrated on some synthetic data contai...
متن کاملMarkov Chain Monte Carlo and Related Topics
This article provides a brief review of recent developments in Markov chain Monte Carlo methodology. The methods discussed include the standard Metropolis-Hastings algorithm, the Gibbs sampler, and various special cases of interest to practitioners. It also devotes a section on strategies for improving mixing rate of MCMC samplers, e.g., simulated tempering, parallel tempering, parameter expans...
متن کاملOptimal Scaling of Metropolis-coupled Markov Chain Monte Carlo
We consider optimal temperature spacings for Metropolis-coupled Markov chain Monte Carlo (MCMCMC) and Simulated Tempering algorithms. We prove that, under certain conditions, it is optimal to space the temperatures so that the proportion of temperature swaps which are accepted is approximately 0.234. This generalises related work by physicists, and is consistent with previous work about optimal...
متن کامل